Adaptive equalization in coherent fiber optic communication

ABSTRACT

An embodiment of the invention is a technique to equalize received samples. A coefficient generator generates filter coefficients using an error vector and input samples. A filter stage generates equalized samples from input samples using the filter coefficients. The received samples are provided by a receiver front end in an optical transmission channel carrying transmitted symbols. Other embodiments are also described.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of U.S. patent application Ser. No. 10/891,694, filed Jul. 14, 2004, which application is specifically incorporated herein, in its entirety, by reference.

BACKGROUND

1. Field of the Invention

Embodiments of the invention relate to optical communication, and more specifically, to digital equalization for optical communication.

2. Description of Related Art

Several impairments may have severe impact on optical communication at data rates of 10 Gigabits/sec (Gb/s) and beyond. These impairments include chromatic dispersion (CD), polarization mode dispersion (PMD), and phase noise of the transmitter, the local oscillator and any other optical components in the optical system such as optical amplifiers.

Existing equalization techniques to compensate for these impairments are inadequate. Linear or decision feedback equalization (DFE) used in intensity modulation/direct detection (IM/DD) receivers has limited effectiveness in single-mode fibers due to the nonlinear behavior of these channels. Adaptation schemes in optical domain techniques are complicated because phase information of the error signal obtained from the electrical domain after direct detection is inherently eliminated. Electronic equalization techniques using microwave and millimeter wave technology are difficult to implement and are not adaptive, leading to poor performance.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention may best be understood by referring to the following description and accompanying drawings that are used to illustrate embodiments of the invention. In the drawings:

FIG. 1 is a diagram illustrating a system in which one embodiment of the invention can be practiced.

FIG. 2 is a diagram illustrating a receiver front end according to one embodiment of the invention.

FIG. 3 is a diagram illustrating a synchrodyne detector according to one embodiment of the invention.

FIG. 4 is a diagram illustrating a matched filter according to one embodiment of the invention.

FIG. 5A is a diagram illustrating a model for a transmission optical channel according to one embodiment of the invention.

FIG. 5B is a diagram illustrating a sub-filter group used in the fiber model according to one embodiment of the invention.

FIG. 6 is a diagram illustrating a signal processor with adaptive equalizer according to one embodiment of the invention.

FIG. 7 is a diagram illustrating an equalizer according to one embodiment of the invention.

FIG. 8 is a diagram illustrating a rotation matrix estimator according to one embodiment of the present invention.

FIG. 9A is a diagram illustrating the loop filter using a proportional filtering in the phase estimator according to one embodiment of the invention.

FIG. 9B is a diagram illustrating the loop filter using a proportional plus integral filtering in the phase estimator according to one embodiment of the invention.

FIG. 10A is a diagram illustrating the loop filter using a proportional filtering in the polarization angle estimator according to one embodiment of the invention.

FIG. 10B is a diagram illustrating the loop filter using a proportional plus integral filtering in the polarization angle estimator according to one embodiment of the invention.

FIG. 11A is a diagram illustrating a SISO-MTFE according to one embodiment of the invention.

FIG. 11B is a diagram illustrating a T-MTFE according to one embodiment of the invention.

FIG. 12 is a diagram illustrating a DFE according to one embodiment of the invention.

FIG. 13 is a diagram illustrating a maximum likelihood sequence estimation receiver (MLSE) receiver according to one embodiment of the invention.

DESCRIPTION

An embodiment of the invention is a technique to equalize received samples. A coefficient generator generates filter coefficients using a rotated error vector. A filter stage generates equalized samples or slicer input vector from received samples or rotated received samples using the filter coefficients. The received samples are provided by a receiver front end in an optical transmission channel carrying transmitted symbols.

Another embodiment of the invention is a technique to equalize received samples. An optical-to-electrical converter (OEC) produces an electrical signal vector representing at least one of amplitude, phase, and polarization information of a modulated optical carrier transmitted through an optical channel with impairments. A signal processor processes the electrical signal vector to compensate the impairments of the optical channel. The signal processor includes at least an adaptive equalizer to generate an equalized output, a decision, and an error. The error is difference between the equalized output and the decision. The adaptive equalizer has an adaptation based on at least the error.

Another embodiment of the invention is a technique to equalize received samples. An equalizer to equalize a multidimensional signal transmitted over a communication channel and having a dimensionality of four or higher. The equalizer is adaptively decision directed trained.

In the following description, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In other instances, well-known circuits, structures, and techniques have not been shown in order not to obscure the understanding of this description.

An embodiment of the present invention is a technique to perform signal equalization in the presence of, without limitation, chromatic dispersion (CD), polarization mode dispersion (PMD), and phase noise. One embodiment of the invention uses a four-dimensional equalizer structure that effectively compensates high order PMD, as well as CD and effects such as polarization-dependent loss. It may also partially compensate the phase noise of the transmitter and the local oscillator. Traditionally, a polarization diversity receiver would normally add the two polarization components after demodulation and detection. In the receiver in one embodiment of the invention, the phase and polarization components are kept separate and processed as a four dimensional vector (or, equivalently, a two-dimensional complex vector) by the equalizer.

FIG. 1 is a diagram illustrating a system 100 in which one embodiment of the invention can be practiced. The system 100 includes a transmitted symbols encoder 105, a communication channel 108, and a signal processor with adaptive equalizer 170.

The transmitted symbols encoder 105 encodes the transmission bits according to some modulation or encoding technique. In one embodiment, the encoder 105 uses a differential quadrature phase shift keying (DQPSK) modulation technique. DQPSK or other phase and/or amplitude modulation techniques may be applied independently to the two axes of polarization of the optical signal, which allows to double the data rate without increasing the symbol rate. A typical symbol rate may be, without limitation, 10 Gigabauds or higher.

The communication channel 108 transmits the encoded symbols over a fiber optic channel to a receiver. It includes an external modulator (EM) 110, a transmitter laser (TL) 120, an optical channel 130, and an optical filter (OF) 140. In another embodiment, the continuous wave (CW) transmitter laser 120 and the external modulator 110 are replaced by a directly modulated laser.

The external modulator 110 uses the transmitted symbols to modulate the optical carrier generated by the transmitter laser. In general, the modulated optical carrier is a combination of multiple modulation formats. It may be one of an intensity-modulated, amplitude-modulated, an amplitude shift keying (ASK)-modulated, a quadrature amplitude-modulated, phase-modulated, a polarization-modulated, a phase and amplitude modulated, a phase and polarization modulated, an amplitude and polarization modulated, a phase, amplitude or polarization modulated optical carriers. The phase-modulated carrier may be, without limitation, QPSK-modulated, 8PSK-modulated, or differentially phase-modulated. The differentially phase modulated carrier may be, without limitation, DPSK-modulated or DQPSK-modulated. The optical channel 130 provides a transmission medium to transmit the modulated transmitted symbols. Typically, the optical channel has noise or impairments that affect the quality of the transmitted symbols. The impairments of the optical channel 130 may include at least one of chromatic dispersion, polarization mode dispersion, polarization dependent loss, polarization dependent chromatic dispersion, multi-path reflection, phase noise, amplified spontaneous emission noise, intensity modulation noise, thermal noise, interference (e.g., crosstalk) noise, etc. It includes the fiber optic components such as 132 and 136, and one or more optical amplifiers 134. The optical amplifiers 134 amplify the transmitted signal while going through the fiber optic medium. They are deployed periodically along the fiber components such as 132 and 136 to compensate the attenuation. They may introduce amplified spontaneous emission (ASE) noise. The optical filter 140 optically filters the optical transmitted signal. The RFE circuit 150 mixes the filtered optical signal with the output of the local oscillator 160 and demodulates it to a baseband signal. In one embodiment of the invention, the detection is a homodyne detection. In another embodiment of the invention, the detection is heterodyne detection. The RFE circuit 150 is an optical-to-electrical converter to generate an electrical signal vector representing at least one of amplitude, phase, and polarization information of the optical transmitted signal.

The signal processor with adaptive equalizer 170 performs equalization and signal detection to generate received symbols corresponding to the transmitted symbols. It processes the electrical signal vector to compensate the impairments of the optical channel. It can be implemented by analog or digital or a combination of analog and digital elements. In one embodiment, it is implemented using very large scale integration (VLSI) components using complementary metal-oxide semiconductor (CMOS) technology. In another embodiment, it may be implemented by firmware or software with programmable processors. It may be also implemented as a simulator or emulator of a receiving signal processor. The signal processor 170 includes at least an adaptive equalizer to generate an equalized output, a decision, and an error. The error is the difference between the equalized output and the decision. The adaptive equalizer has an adaptation based on at least the error. The adaptation uses at least one of a zero-forcing criterion and a mean-squared error criterion. The adaptive equalizer may be a multidimensional transversal filter equalizer which may be fractionally or baud rate spaced. It equalizes a multidimensional signal having a dimensionality of four or higher and may be adaptively decision-directed trained. It may be any one of the following types: linear, decision feedback, maximum likelihood sequence estimation (MLSE), or any combination of these types. The MLSE equalizer can compensate for nonlinear distortion in the optical fiber (e.g, fibers such as 132 and 136 in FIG. 1). The signal processor 170 includes at least a phase rotator, a polarization angle rotator, and a phase and polarization rotator. The signal processor 170, the receiver front end (RFE) 150, and the local oscillator (LO) 160 form the optical receiver 180 in the system.

The electrical field component (EFC) of the electromagnetic wave at the output of the external modulator 110 (EM) can be written as {right arrow over (E)}(t)=E _(x)(t){right arrow over (x)}+E _(y)(t){right arrow over (y)}=(e ₁ +je ₂){right arrow over (x)}+(e ₃ +je ₄){right arrow over (y)},  (1)

where e₁ and e₂ are the in-phase and quadrature components of the {right arrow over (x)}-aligned EFC E_(x)(t), while e₃ and e₄ are the corresponding components of the {right arrow over (y)}-aligned EFC E_(y)(t). {right arrow over (x)} and {right arrow over (y)} are unit vectors along the orthogonal axes of polarization. Notice that {right arrow over (E)} (t) can be treated either as a 4-dimensional real vector or as a 2-dimensional complex vector. In (1) j means imaginary unit (i.e. j=√{square root over (−1)}). Let {tilde over (E)} (ω)=[E_(x)(ω) E_(y)(ω)]^(T) ^(r) be the Fourier transform of vector {right arrow over (E)} (t) where T_(r) denotes transpose. Then, ignoring the nonlinear effects and polarization dependent loss (PDL), the fiber propagation equation that takes into account all order PMD, chromatic dispersion, and attenuation is given by:

$\begin{matrix} \begin{matrix} {\begin{bmatrix} {{\hat{E}}_{x}(\omega)} \\ {{\hat{E}}_{y}(\omega)} \end{bmatrix} = {{\mathbb{e}}^{{- \alpha}\; L}{\mathbb{e}}^{{- {{j\beta}{(\omega)}}}L}J{\overset{\sim}{E}(\omega)}}} \\ {= {{\mathbb{e}}^{{- \alpha}\; L}{{{\mathbb{e}}^{{- {{j\beta}{(\omega)}}}L}\begin{bmatrix} {u_{1}(\omega)} & {u_{2}(\omega)} \\ {- {u_{2}^{*}(\omega)}} & {- {u_{1}^{*}(\omega)}} \end{bmatrix}}\begin{bmatrix} {E_{x}(\omega)} \\ {E_{y}(\omega)} \end{bmatrix}}}} \end{matrix} & (2) \end{matrix}$

In this model, J is the well-known Jones matrix. This model accounts for high order PMD. Parameter β(ω), which accounts for chromatic dispersion, is obtained by averaging the propagation constants of the two principal states of polarization β(ω)=(β_(x)(ω)+β_(y)(ω))/2. Parameter α is the fiber loss. In practical systems, it can be assumed to be a constant within the signal bandwidth. L is the fiber length.

FIG. 2 is a diagram illustrating the receiver front end (RFE) circuit 150 according to one embodiment of the invention. The RFE circuit 150 includes two polarization beam splitters 212 and 214, two optical hybrid circuits 222 and 224, four balanced photodiodes 232, 234, 236, and 238, four transimpedance amplifiers (TIAs) 233, 235, 237 and 239, and a sampler 240. The receiver front end 150 is an optical to electrical converter that produces an electrical signal vector representing at least one of amplitude, phase, and polarization information of the modulated optical carrier transmitted through the optical channel 130 with impairments.

The polarization beam splitters 212 and 214 separate the polarization components of the corresponding outputs of the local oscillator 160 and the optical filter 140, respectively. The local oscillator 160 is linearly polarized at π/4 with respect to the receiver reference axes. The two hybrid circuits 222 and 224 have four ports and combine the split components of the optical signals from the optical filter 140 and the local oscillator 160.

The balanced photodiodes 232, 234, 236, and 238 detect the electrical field components (EFCs) at the outputs of the hybrid circuits 222 and 224 to produce four signals r₁, r₂, r₃, and r₄. This balanced architecture has the advantage of suppressing the relative intensity noise (RIN).

Assume that (i) all photodiodes responsivities are equal to unity, and (ii) TIAs gains are equal to K. The currents at the output of each photodiode for the {right arrow over (x)} polarization are given by: P _(1x) =|E _(LO)|² +|Ê _(x)(t)|²+2Re{Ê _(x)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φt(t)))}, P _(2x) =|E _(LO)|² +|Ê _(x)(t)|²−2Re{Ê _(x)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(x) ^((t)))}, P _(3x) =|E _(LO)|² +|Ê _(x)(t)|²+2Im{Ê _(x)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(x) ^((t)))}, P _(4x) =|E _(LO)|² +|Ê _(x)(t)|²−2Im{Ê _(x)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(x) ^((t)))},  (3) where Ê_(x) (t) and E_(LO) are the complex electrical fields envelopes of the received signal and local oscillator, respectively, ω_(s) and ω_(LO) are their angular optical frequencies, and φ_(x) (t) accounts for phase noise in the {right arrow over (x)} polarization.

In a similar way, the currents at the output of each photodiode for {right arrow over (y)} polarization are given by: P _(1y) =|E _(LO)|² +|Ê _(y)(t)|²+2Re{Ê _(y)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(y) ^((t)))}, P _(2y) =|E _(LO)|² +|Ê _(y)(t)|²−2Re{Ê _(y)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(y) ^((t)))}, P _(3y) =|E _(LO)|² +|Ê _(y)(t)|²+2Im{Ê _(y)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(y) ^((t)))}, P _(4y) =|E _(LO)|² +|Ê _(y)(t)|²−2Im{Ê _(y)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(y) ^((t)))}.  (4)

Due to the balanced detection, currents on the balanced photodiodes are subtracted to provide: P _(x) ^(I) =P _(1x) −P _(2x)=4Re{Ê _(x)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(x) ^((t)))}, P _(x) ^(Q) =P _(3x) −P _(4x)=4Im{Ê _(x)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(x) ^((t)))}, P _(y) ^(I) =P _(1y) −P _(2y)=4Re{Ê _(y)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(y) ^((t)))}, P _(y) ^(Q) =P _(3y) −P _(4y)=4Im{Ê _(y)(t)E _(LO) *e ^(j((ω) ^(s) ^(−ω) ^(LO) ^()t+φ) ^(y) ^((t)))}.  (5)

Finally, the signals at the input of sampler 240 are: r ₁ =KP _(x) ^(I), r ₂ =KP _(x) ^(Q), r ₃ =KP _(y) ^(I), r ₄ =KP _(y) ^(Q).  (6) r _(x) =r ₁ +jr ₂ r _(y) =r ₃ +jr ₄  (7)

The r₁ and r₂ signals are the in-phase and quadrature components of the received EFC Ê_(x) (t). The r₃ and r₄ signals are the in-phase and quadrature components of the received EFC Ê_(y) (t). Without loss of generality, the demodulation may be considered an ideal homodyne demodulation, that is ω_(LO)=ω_(s).

The sampler 240 samples the signals r₁, r₂, r₃, and r₄ to produce the sampled signals. The sampling rate may be at the symbol period T or a fraction of T if a fractionally spaced processing is used. The sampled signals then go to the signal processor with adaptive equalizer 170 for further detection. For analog implementation, the sampled signals are discrete-time signals. For digital implementation, the sampled signals may go through analog-to-digital conversors to produce digital data.

The noise sources present in the system include, without limitation, amplified spontaneous emission (ASE), shot, thermal, and phase noise. In DWDM systems they may also include four-wave mixing (FWM) and cross-phase modulation (CPM). ASE noise is introduced by optical amplifiers and can be modeled as additive white Gaussian noise (AWGN) in each polarization in the electromagnetic field domain. Shot noise has a Poisson distribution, but for large numbers of incident photons its distribution can be closely approximated as a Gaussian. Thermal noise from the analog front-end of the receiver is modeled as a Gaussian variable. Phase noise is also present in the signal, as a result of phase fluctuations in the transmitter laser, and the local oscillator laser and other optical components such optical amplifiers. It is usually characterized as a Wiener process, φ(t)

∫₀ ^(t)φ′(τ)dτ, where the time derivative φ′(t) is a zero-mean white Gaussian process with a power spectral density S_(φ′(ω))=2πΔν, and Δν is defined as the laser linewidth parameter. As seen in equations (3) and (4), different phase noise components φ_(x) (t) and φ_(y) (t) have been introduced for each polarization. Lasers diodes with Δν≈1−5 MHz are available today. The problem of phase noise can be reduced using differential PSK (DPSK) modulation, where the information is encoded by changes in phase from one symbol to the next. FWM and CPM are the result of crosstalk among different wavelengths in a DWDM system. The crosstalk is originated by nonlinearities.

The decoding or signal detection technique may be implemented by a synchrodyne detection or a differential detection scheme. The synchrodyne detection results in a lower penalty than the differential detection. One embodiment of the invention uses synchrodyne detection.

FIG. 3 is a diagram illustrating a synchrodyne detector 300 according to one embodiment of the invention. The detector 300 includes a rotator 320, slicers 330 and 340, and differential decoders 350 and 360. The rotator 320 rotates the phase and polarity of the inputs q_(x) ^((k)) and q_(y) ^((k)) to produce d_(x) ^((k)) and d_(y) ^((k)).

The slicers 330 and 340 essentially slice the inputs d_(x) ^((k)) and d_(y) ^((k)), respectively, by some predetermined threshold. The differential decoders 350 and 360 subtract the phases by multiplying the symbol with the complex conjugate of the delayed symbol. The differential decoder 350 includes a delay element 352, a complex conjugator 354, and a multiplier 370. The differential decoder 360 includes a delay element 362, a complex conjugator 364, and a multiplier 380. The delay elements 352 and 362 delay the slicer outputs ā_(x) ^((k)) and ā_(y) ^((k)), respectively, by a symbol period. The complex conjugators 354 and 364 obtain the complex conjugates of the delayed ā_(x) ^((k−1)) and ā_(y) ^((k−1)), to produce (ā_(x) ^((k−1)))* and (ā_(y) ^((k−1)))*, respectively. The multipliers 370 and 380 multiply ā_(x)(k) with (ā_(x) ^((k−1)))* and ā_(y) ^((k)) with (ā_(y) ^((k−1)))*, respectively, to produce â_(x) ^((k)) and â_(y) ^((k)): â _(x) ^((k)) =â _(x) ^((k))·(â _(x) ^((k−1)))*  (8) â _(y) ^((k)) =â _(y) ^((k))·(â _(y) ^((k−1)))*  (9)

FIG. 4 is a diagram illustrating a matched filter circuit 400 according to one embodiment of the invention.

The matched filter circuit 400 includes a matched filter (MF) 410 and a sampler 420. It is possible to verify that the MF 410 compensates most of the channel impairments and no further signal processing is needed prior to detection. In real situations, the MF 410 is hard to synthesize because of the complexity of the channel response and its non-stationary nature due to the PMD. An alternative structure for the receiver is to use a low pass filter G 430, followed by a sampler 440 and an equalizer C 450 as shown in FIG. 4. The output of the low pass filter G 430 includes the noise components n_(x) ^((k)) and n_(y) ^((k)).

FIG. 5A is a diagram illustrating an equivalent model 500 for a transmission optical channel according to one embodiment of the invention. The model 500 includes an encoder 510 and a discrete time channel model 540.

The encoder 510 is a model for the transmitted symbol encoder 105 shown in FIG. 1. It includes multipliers 522 and 524 and delay elements 532 and 534. At the transmitter, the M-ary differential phase shift keying (MDPSK) symbols a_(j)εA={e^(j2πν/M)|νε{0, 1, . . . , M−1}} j=x, y are differentially encoded. The resulting MPSK symbols are: b _(j) ^((k)) =a _(j) ^((k)) b _(j) ^((k−1))  (10) where j=x, y.

The baseband equivalent model of the channel is defined by

$\begin{matrix} {{{H(t)} = \begin{bmatrix} {h_{11}(t)} & {h_{12}(t)} \\ {h_{21}(t)} & {h_{22}(t)} \end{bmatrix}},} & (11) \end{matrix}$ with h ₁₁(t)=ℑ⁻¹(e ^(−jβ(ω)L) u ₁(ω)){circle around (x)}ƒ(t) h ₁₂(t)=ℑ⁻¹(e ^(−jβ(ω)L) u ₂(ω)){circle around (x)}ƒ(t) h ₂₁(t)=ℑ⁻¹(−e ^(−jβ(ω)L) u ₂*(ω)){circle around (x)}ƒ(t) h ₂₂(t)=ℑ⁻¹(e ^(−jβ(ω)L) u ₁*(ω)){circle around (x)}ƒ(t)  (12) where ƒ(t) is the impulse response that includes the low pass filter 430 as well as any other linear element in the link, and ℑ⁻¹ represents the inverse Fourier transform operator.

The equalizer is, in general, fractionally spaced with sampling rate N times higher than the symbol rate, the channel may be modeled by N sub-filters 580 ₁ to 580 _(N) h_(ij) ^((m)) with m=0, 1, . . . , N−1 and i, j=1, 2, corresponding to N sampling instants

$t = {\left( {k + \frac{m}{n}} \right)T}$ per symbol period T. The sampling rate of each sub-filter is the same as the symbol rate,

$\frac{1}{T}.$ Note that the rate of the output selector 585 is N times the symbol rate, that is,

$\frac{N}{T}.$ Then, the discrete model of the equivalent channel can be written as: h ₁₁ ^((m)) ={h ₁₁ ^((0,m)) ,h ₁₁ ^((1,m)) , . . . , h ₁₁ ^((L) ^(h,m) ^(−1,m))}, h ₁₂ ^((m)) ={h ₁₂ ^((0,m)) ,h ₁₂ ^((1,m)) , . . . , h ₁₂ ^((L) ^(h,m) ^(−1,m))}, h ₂₁ ^((m)) ={h ₂₁ ^((0,m)) ,h ₂₁ ^((1,m)) , . . . , h ₂₁ ^((L) ^(h,m) ^(−1,m))}, h ₂₂ ^((m)) ={h ₂₂ ^((0,m)) ,h ₂₂ ^((1,m)) , . . . , h ₂₂ ^((L) ^(h,m) ^(−1,m))},  (13) where L_(h,m) is the number of coefficient of m-th sub-filter. Note that the total number of coefficients needed to model the channel is

$L_{h} = {\sum\limits_{m = 0}^{N - 1}\;{L_{h,m}.}}$ In addition, the samples at the input of the channel model are spaced T seconds apart, while the output samples are spaced T/N seconds apart.

The discrete time channel model includes a fiber model H 550, two multipliers 562 and 564, two adders 566 and 568, and a polarization rotator 570. The fiber model H 550 has the coefficients h_(ij). It acts like a finite impulse response (FIR) filter operating on the MPSK symbols b_(x) ^((k)) and b_(y) ^((k)) as shown above. The multipliers 562 and 564 introduce the phases shift of and φ_(x) ^((k)) and φ_(y) ^((k)). The adders 566 and 568 add the noise components at the output of the low pass filter 430 n_(x) ^((k,m)) and n_(y) ^((k,m)) to the output of the H filter to generate {circumflex over (r)}_(x) ^((k,m)) and {circumflex over (r)}_(y) ^((k,m)). The polarization rotator 570 rotates the polarization of {circumflex over (r)}_(x) ^((k,m)) and {circumflex over (r)}_(y) ^((k,m)). It is represented by a matrix P^((k,m)) to model variations in the angle of polarization, due to imperfections in the transmitter and local oscillator laser.

The received samples at the outputs of the channel can be expressed as:

$\begin{matrix} {{\begin{bmatrix} r_{x}^{({k,m})} \\ r_{y}^{({k,m})} \end{bmatrix} = {P^{({k,m})}\begin{bmatrix} {\hat{r}}_{x}^{({k,m})} \\ {\hat{r}}_{y}^{({k,m})} \end{bmatrix}}},} & (14) \end{matrix}$ where

$\begin{matrix} {{P^{({k,m})} = \begin{bmatrix} {\cos\left( \theta^{({k,m})} \right)} & {- {\sin\left( \theta^{({k,m})} \right)}} \\ {\sin\left( \theta^{({k,m})} \right)} & {\cos\left( \theta^{({k,m})} \right)} \end{bmatrix}},} & (15) \\ {{\hat{r}}_{x}^{({k,m})} = {{{\mathbb{e}}^{j\;\phi_{x}^{({k,m})}}\left( {{\sum\limits_{n = 0}^{L_{h,m} - 1}\;{h_{11}^{({n,m})}b_{x}^{({k - n})}}} + {\sum\limits_{n = 0}^{L_{h,m} - 1}\;{h_{12}^{({n,m})}b_{y}^{({k - n})}}}} \right)} + n_{x}^{({k,m})}}} & (16) \\ {{\hat{r}}_{y}^{({k,m})} = {{{\mathbb{e}}^{j\;\phi_{y}^{({k,m})}}\left( {{\sum\limits_{n = 0}^{L_{h,m} - 1}\;{h_{21}^{({n,m})}b_{x}^{({k - n})}}} + {\sum\limits_{n = 0}^{L_{h,m} - 1}\;{h_{22}^{({n,m})}b_{y}^{({k - n})}}}} \right)} + n_{y}^{({k,m})}}} & (17) \end{matrix}$ The received samples include the effects of rotations of the polarization angle.

The fiber model 550 includes sub-filter groups h₁₁ 551, h₁₂ 552, h₂₁ 553, h₂₂ 554, and two adders 555 and 556. The adder 555 adds the outputs of sub-filter groups 551 and 552. The adder 556 adds the outputs of sub-filters groups 553 and 554.

FIG. 5B is a diagram illustrating a sub-filter group 551 used in the fiber model 550 according to one embodiment of the invention. The sub-filter group 551 is representative of the groups 551, 552, 553, and 554. The sub-filter group 551 includes N sub-filters 580 ₁ to 580 _(N) and an output selector 585.

Each of the sub-filters 580 ₁ to 580 _(N) represent a filter operating at the symbol rate of 1/T. The output selector 585 selects the sub-filters 580 ₁ to 580 _(N) at a selection rate of N/T.

Based on these equations that model the discrete time channel, the signal processor that process the received signals r_(x) ^((k)) and r_(y) ^((k)) may be developed. The signal processor generates the received symbols that correspond to the transmitted symbols.

FIG. 6 is a diagram illustrating the signal processor with adaptive equalizer 600 according to one embodiment of the invention. The model 600 includes an equalizer 610, inverse rotator 615, a rotator 620, a slicer 630, an error calculator 640, a delay conjugator 650, a multiplier 670, and a rotation matrix estimator 680.

The model 600 in essence represents the signal processor 170 shown in FIG. 1. It performs signal equalization and detection to generate the received symbols â_(x) ^((k)) and â_(y) ^((k)). For clarity, the elements in the model are shown to operate on column vectors. Each vector represents the first and second dimensions x and y. Therefore, each element except the inputs to the equalizer 610 represents two complex elements, one operating on the x dimension and the other operating on the y dimension.

The adaptive equalizer 610 equalizes the received samples r_(x) ^((k)) and r_(y) ^((k)) using coefficient matrix C^((k,m)). It may be an adaptive equalizer. It may be adaptively decision-directed trained. It is contemplated that although the equalizer 610 is described in the context of an optical receiver, it may be used in other non-optical applications, such as digital microwave radio receivers that use the polarization of the electromagnetic waves to carry more information. It may also be used in applications where there is no polarization information such as Orthogonal Frequency Division Multiplexing (FDM) receivers. The equalizer 610 generates the equalized samples q_(x) ^((k)) and q_(y) ^((k)). Since the equalizer can be in general fractionally spaced, the coefficients can be described by N matrices, or sub-equalizers, each one working at the symbol rate as follows

$\begin{matrix} {{C^{({k,m})} = \begin{bmatrix} c_{11}^{({k,m})} & c_{12}^{({k,m})} \\ c_{21}^{({k,m})} & c_{22}^{({k,m})} \end{bmatrix}},} & (18) \end{matrix}$ where m=0, 1, . . . , N−1, c_(ij) ^((k,m))={c_(ij) ^((k,m)(0)), c_(ij) ^((k,m)(1)), . . . , c_(ij) ^((k,m)(L) ^(c,m) ⁻¹⁾} with i, j=1, 2.

Parameter L_(c,m) is the number of coefficients of m-th sub-equalizer. The output of the equalizer is obtained by adding all sub-equalizers outputs, and the total number of coefficients of the equalizer is

$L_{c} = {\sum\limits_{m = 0}^{N - 1}\;{L_{c,m}.}}$ The received samples r_(x) ^((k,m)) and r_(y) ^((k,m)) are processed by the adaptive equalizer 610, whose sampling rate is, in general, N times the baud rate. Note that samples at the baud rate are needed to feed the detector. Therefore, among the N samples at the equalizer output existing in a period T, the one corresponding to a certain instant m₀ (m₀ε{0, 1, . . . , N−1}) is selected. Clearly, samples corresponding to values of m different from m₀ do not need to be computed. For simplicity of notation, index m₀ is dropped from all signals at the output of the equalizer. Furthermore, m₀ may be considered zero since the equalizer coefficients are automatically adjusted by the coefficient generator algorithm. Thus, the equalizer output samples to be processed by the detector, at baud rate, may be expressed as:

$\begin{matrix} {{q_{x}^{(k)} = {{\sum\limits_{1 = 0}^{N - 1}\;{\sum\limits_{n = 0}^{L_{c,l} - 1}{c_{11}^{{({k,l})}{(n)}}r_{x}^{({{k - n},1})}}}} + {\sum\limits_{1 = 0}^{N - 1}\;{\sum\limits_{n = 0}^{L_{c,l} - 1}{c_{21}^{{({k,1})}{(n)}}r_{y}^{({{k - n},1})}}}}}}{q_{y}^{(k)} = {{\sum\limits_{1 = 0}^{N - 1}\;{\sum\limits_{n = 0}^{L_{c,l} - 1}{c_{12}^{{({k,l})}{(n)}}r_{x}^{({{k - n},1})}}}} + {\sum\limits_{1 = 0}^{N - 1}\;{\sum\limits_{n = 0}^{L_{c,l} - 1}{c_{22}^{{({k,1})}{(n)}}r_{y}^{({{k - n},1})}}}}}}} & (19) \end{matrix}$

The inverse rotator 615 generates a rotated error vector {tilde over (e)}^((k)) using the phase and polarization rotation matrix A^((k)) from the rotation matrix estimator 680 and the error vector e^((k)) from the error calculator 640. It includes a transpose conjugator 617 and a multiplier 618. The transpose conjugator 617 computes the inverse of the phase and polarization rotation matrix A^((k)). Since the matrix A^((k)) is unitary, its inverse (A^((k)))⁻¹ is equal to (A^((k)))^(H) where H denotes the transpose conjugate. The multiplier 618 multiplies the error vector e^((k)) with the inverse (A^((k)))⁻¹ to generate the rotated error vector {tilde over (e)}^((k)). The multiplication is a matrix per vector product. {tilde over (e)} ^((k))=(A ^((k)))⁻¹ ·e ^((k))  (20)

In one embodiment, the rotator 620 rotates the phase and polarization of the equalized samples q^((k)) to generate the rotated vector d^((k)). It includes a multiplier 625 to perform a matrix per vector multiplication of A^((k)) and q^((k)) as follows: d ^((k)) =A ^((k)) ·q ^((k))  (21) where:

$\begin{matrix} {d^{(k)} = {{\begin{bmatrix} d_{x}^{(k)} \\ d_{y}^{(k)} \end{bmatrix}\mspace{14mu}{and}\mspace{14mu} q^{(k)}} = \begin{bmatrix} q_{x}^{(k)} \\ q_{y}^{(k)} \end{bmatrix}}} & (22) \end{matrix}$

In another embodiment, the rotator 620 rotates the phase and polarization of the received samples before equalization. In other words, the rotator 620 may be placed after or before the equalizer 610. The vector d^((k)), therefore, may represent a rotated-then-equalized vector or an equalized-then-rotated vector. For brevity, the vector d^((k)) is referred to as the slicer input vector.

The slicer 630 thresholds the slicer input vector d^((k)) by a predetermined threshold to generate a slicer output vector ā^((k)). The error calculator 640 calculates an error vector e^((k)). It includes an adder/subtractor to subtract the slicer input vector d^((k)) from the slicer output vector ā^((k)). The error vector e^((k)) is given as follows:

$\begin{matrix} {e^{(k)} = {\begin{bmatrix} e_{x}^{(k)} \\ e_{y}^{(k)} \end{bmatrix} = \begin{bmatrix} {{\overset{\_}{a}}_{x}^{(k)} - d_{x}^{(k)}} \\ {{\overset{\_}{a}}_{y}^{(k)} - d_{y}^{(k)}} \end{bmatrix}}} & (23) \end{matrix}$

The delay conjugator 650 generates a delayed conjugated vector (ā^((k−1)))*from the slicer output vector ā^((k)). It includes a delay element 652 and a conjugator 654. The delay element 652 delays the slicer output vector ā^((k)) by one sample. The conjugator 654 provides the complex conjugate of the delayed ā^((k)).

The multiplier 670 generates the received symbol vector â^((k)) which is an estimate of the transmitted symbol vector. The multiplier 670 multiplies, element by element, the slicer output vector ā^((k)) with the delayed conjugated vector (ā^((k−1)))*.

The rotation matrix estimator 680 generates the phase and polarization rotation matrix A^((k)) from the slicer input vector d^((k)) and the slicer output vector ā^((k)). The rotation matrix estimator 680 will be described in detail in FIG. 8.

FIG. 7 is a diagram illustrating the equalizer 610 according to one embodiment of the invention. The equalizer 610 includes a coefficient generator 720 and a filter stage 730. The equalizer 610 operates on multidimensional vector or elements. In the following description, for illustrative purposes, only four filters and two dimensions are shown. It is contemplated more or less than four filters and more or less than two dimensions may be used.

The coefficient generator 720 generates the filter coefficients to the filter stage 730 using the rotated error vector {tilde over (e)}^((k)) provided by the inverse rotator 615 (FIG. 6). It includes a coefficient adjuster 722, an adder 724, and a delay element 726.

The filter coefficients may be adaptively generated based on some optimality criterion. Two criteria may be considered to find the filter coefficients: the peak distortion criterion and the minimum mean squared error (MMSE) criterion. The peak distortion criterion may eliminate the dispersion effect by inverting the channel response. However, noise amplification may occur. The MMSE criterion reduces noise enhancement and can achieve better performance. In one embodiment, the MMSE criterion is used. To determine the filter coefficients, a stochastic gradient technique is used. The filter coefficient vector is recursively calculated using a coefficient adjustment vector based on the error vector and the estimated phase value.

The coefficient adjuster 722 generates a coefficient adjustment vector to adjust the coefficient vector C^((k,m)) of the filter coefficients. The coefficient adjustment vector is a product of the rotated error vector {tilde over (e)}^((k)), a received sample vector representing the received samples R^((k,m)), and a step size parameter ρ. The adder 724 adds the previously calculated coefficient vector C^((k,m)) to the coefficient adjustment vector to generate the coefficient vector representing the filter coefficients. The previously calculated coefficient vector may be obtained by the delay element 726. The delay element 726 may be implemented as a storage register. The coefficient generator 720, therefore, calculates the adaptive coefficient filter vector as follows: C ^((k+1,m)) =C ^((k,m)) +ρ[R ^((k,m)]) ^(H) [{tilde over (e)} ^((k))]^(Tr),  (24) where H denotes conjugate transpose, Tr denotes transpose; R^((k,m))=[r_(x) ^((k,m)) r_(y) ^((k,m))], r_(x) ^((k,m)) and r_(y) ^((k,m)) are the L_(c,m)-dimensional row vectors with the received samples at instant k; and ρ is the step size parameter. In one embodiment, 0.0001≦ρ≦0.001. The coefficient filter vector C^((k,m)) is:

$\begin{matrix} {{C^{({k,m})} = \begin{bmatrix} c_{11}^{({k,m})} & c_{12}^{({k,m})} \\ c_{21}^{({k,m})} & c_{22}^{({k,m})} \end{bmatrix}},} & (25) \end{matrix}$ where c_(ij) ^((k,m)) are the L_(c,m)-dimensional column vectors with equalizer coefficients at the instant k and subequalizer m.

The filter stage 730 generates equalized samples or a slicer input vector (when the rotator 620 is placed before the equalizer 610) from the received samples using the filter coefficients provided by the coefficient generator 720 and the received samples R^((k,m)) provided by the receiver front end circuit 150 in the optical transmission channel 108 (FIG. 1) carrying transmitted symbols.

The filter stage includes at least four finite impulse response (FIR) filters 731, 732, 733, and 734, and two adders 737 and 738. The four FIR filters 731, 732, 733, and 734 operate on the at least four filter coefficient vectors c₁₁, c₁₂, c₂₁, and c₂₂, respectively, and the received samples r_(x) ^((k)) and r_(y) ^((k)), to produce at least four filtered results. The four filter coefficient vectors c₁₁, c₁₂, c₂₁, and c₂₂ are spanned on first and second dimensions x and y. The two adders 737 and 738 add the filtered results on the first and second dimensions x and y, respectively, to generate the equalized samples q_(x) ^((k)) and q_(y) ^((k)) as shown in equation (19). These equalized samples are then processed in subsequent stages as shown in FIG. 6.

FIG. 8 is a diagram illustrating a rotation matrix estimator 680 according to one embodiment of the present invention. It generates the phase and polarization rotation matrix A^((k)) from the slicer output vector ā^((k)) and the slicer input vector d^((k)). It includes a transposed conjugator 805, a phase estimator 810, a polarization angle estimator 820, and a rotation matrix calculator 830. The transpose conjugator 805 computes the conjugate transpose of the thresholded rotated vector ā^((k)). The phase estimator 810 estimates the phase angle vector for each polarization ({circumflex over (Φ)}^((k+1))=({circumflex over (φ)}_(x) ^((k+1)), {circumflex over (φ)}_(y) ^((k+1)))) from (ā^((k)))^(H) and d^((k)). It includes a phase angle calculator 812, a loop filter 814, an adder 816, and a delay element 818. The polarization angle estimator 820 estimates the polarization angle {circumflex over (θ)}^((k+1)) from (ā^((k)))^(H) and d^((k)). It includes a polarization angle calculator 822, a loop filter 824, an adder 826, and a delay element 828. Usually, the polarization angle of the transmitted laser and local oscillator varies in time. When these variations are slow, the adaptive equalizer can track the polarization rotation. However, fast changes in the polarization angle could not be tracked and performance degrades. To avoid this problem, an estimator of the rotation angle may be used, in a similar way to the phase noise case.

The phase angle calculator 812 calculates the phase angle vector φ^((k))=(φ_(x) ^((k)), φ_(y) ^((k))). The polarization angle calculator 822 calculates the polarization angle κ^((k)). The derivations of φ^((k)) and κ^((k)) are given below.

The vector d^((k)) can be viewed as a rotated version of ā^((k)):

$\begin{matrix} {d^{(k)} = {{{\begin{bmatrix} c_{x} & 0 \\ 0 & c_{y} \end{bmatrix}\begin{bmatrix} {\exp\left( {j\;\varphi_{x}^{(k)}} \right)} & 0 \\ 0 & {\exp\left( {j\;\varphi_{y}^{(k)}} \right)} \end{bmatrix}}\begin{bmatrix} {\cos\left( \kappa^{(k)} \right)} & {- {\sin\left( \kappa^{(k)} \right)}} \\ {\sin\left( \kappa^{(k)} \right)} & {\cos\left( \kappa^{(k)} \right)} \end{bmatrix}}{\overset{\_}{a}}^{(k)}}} & (26) \\ {d^{(k)} = {\begin{bmatrix} {c_{x}{\cos\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{x}^{(k)}} \right)}} & {{- c_{x}}{\sin\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{x}^{(k)}} \right)}} \\ {c_{y}{\sin\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{y}^{(k)}} \right)}} & {c_{y}{\cos\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{y}^{(k)}} \right)}} \end{bmatrix}{\overset{\_}{a}}^{(k)}}} & (27) \\ {{d^{(k)} = \begin{bmatrix} {{c_{x}{\cos\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{x}^{(k)}} \right)}{\overset{\_}{a}}_{x}^{(k)}} - {c_{x}{\sin\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{x}^{(k)}} \right)}{\overset{\_}{a}}_{y}^{(k)}}} \\ {{c_{y}{\sin\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{y}^{(k)}} \right)}{\overset{\_}{a}}_{x}^{(k)}} + {c_{y}{\cos\left( \kappa^{(k)} \right)}{\exp\left( {j\;\varphi_{y}^{(k)}} \right)}{\overset{\_}{a}}_{y}^{(k)}}} \end{bmatrix}},} & (28) \end{matrix}$ where c_(x) and c_(y) are factors introduced to allow for the possibility of independent gain error for each polarization state.

Using the last N_(κ) symbol intervals, the average value of d^((k)) (ā^((k)))^(H) may be computed as:

$\begin{matrix} {M_{\kappa}^{(k)} = {\begin{bmatrix} M_{\kappa\; 11}^{(k)} & M_{\kappa\; 12}^{(k)} \\ M_{\kappa\; 21}^{(k)} & M_{\kappa\; 22}^{(k)} \end{bmatrix} = {\quad{{\frac{1}{N_{\kappa}}{\sum\limits_{1 = 0}^{N_{\kappa} - 1}\left\{ {d^{({k - 1})}\left( {\overset{\_}{a}}^{({k - 1})} \right)} \right\}^{H}}} \cong {\quad{\left\lbrack \begin{matrix} \begin{matrix} {c_{x}B_{\kappa}^{(k)}{\cos\left( \kappa^{(k)} \right)}\frac{1}{N_{\kappa}}{\sum\limits_{1 = 0}^{N_{\kappa} - 1}{\exp\left( {j\;\varphi_{x}^{({k - 1})}} \right)}}} \\ {c_{y}B_{\kappa}^{(k)}{\sin\left( \kappa^{(k)} \right)}\frac{1}{N_{\kappa}}{\sum\limits_{1 = 0}^{N_{\kappa} - 1}{\exp\left( {j\;\varphi_{y}^{({k - 1})}} \right)}}} \end{matrix} & \begin{matrix} {{- c_{x}}B_{\kappa}^{(k)}{\sin\left( \kappa^{(k)} \right)}\frac{1}{N_{\kappa}}{\sum\limits_{1 = 0}^{N_{\kappa} - 1}{\exp\left( {j\;\varphi_{x}^{({k - 1})}} \right)}}} \\ {c_{y}B_{\kappa}^{(k)}{\cos\left( \kappa^{(k)} \right)}\frac{1}{N_{\kappa}}{\sum\limits_{1 = 0}^{N_{\kappa} - 1}{\exp\left( {j\;\varphi_{y}^{({k - 1})}} \right)}}} \end{matrix} \end{matrix} \right\rbrack,}}}}}} & (29) \end{matrix}$ where

$\begin{matrix} {B_{\kappa}^{(k)} = \left. {\frac{1}{N_{\kappa}}\sum\limits_{1 = 0}^{N_{\kappa} - 1}}\; \middle| {\overset{\_}{a}}_{x}^{({k - 1})} \right|^{2}} & (30) \end{matrix}$ assuming

$\begin{matrix} {\sum\limits_{1 = 0}^{N_{\kappa} - 1}\;\left| {\overset{\_}{a}}_{x}^{({k - 1})} \middle| {}_{2}{\cong \sum\limits_{1 = 0}^{N_{\kappa} - 1}}\; \middle| {\overset{\_}{a}}_{y}^{({k - 1})} \right|^{2}} & (31) \end{matrix}$

Parameter N_(κ) is selected large enough to remove cross-terms appearing in

${\frac{1}{N_{\kappa}}{\sum\limits_{1 = 0}^{N_{\kappa} - 1}\;\left\{ {d^{({k - 1})}\left( {\overset{\_}{a}}^{({k - 1})} \right)}^{H} \right\}}},$ and sufficiently small so that the polarization angle κ^((k)) can be considered constant over the interval of length N_(κ).

Then, from matrix M_(κ) ^((k)) the angle κ^((k)) may be computed as follow:

$\begin{matrix} {{\kappa^{(k)} = {\frac{1}{2}\left( {\kappa_{1}^{(k)} + \kappa_{2}^{(k)}} \right)}},{\kappa_{1}^{(k)} = {\arctan\left( {M_{\kappa 21}^{(k)}/M_{\kappa 22}^{(k)}} \right)}},{\kappa_{2}^{(k)} = {{\arctan\left( {{- M_{\kappa 11}^{(k)}}/M_{\kappa 12}^{(k)}} \right)}.}}} & (32) \end{matrix}$

Similarly, by selecting a proper value for the period N_(φ), it is possible to obtain phases φ_(x) ^((k)) and φ_(y) ^((k)) as:

$\begin{matrix} {{\varphi_{x}^{(k)} = {\frac{1}{2}{{angle}\left( {\left( M_{\varphi 11}^{(k)} \right)^{2} + \left( M_{\varphi 12}^{(k)} \right)^{2}} \right)}}}{{\varphi_{y}^{(k)} = {\frac{1}{2}{{angle}\left( {\left( M_{\varphi 21}^{(k)} \right)^{2} + \left( M_{\varphi 22}^{(k)} \right)^{2}} \right)}}},}} & (33) \end{matrix}$ where

$\begin{matrix} {M_{\varphi}^{(k)} = {\begin{bmatrix} M_{\varphi 11}^{(k)} & M_{\varphi 12}^{(k)} \\ M_{\varphi 21}^{(k)} & M_{\varphi 22}^{(k)} \end{bmatrix} = {{\frac{1}{N_{\varphi}}{\sum\limits_{1 = 0}^{N_{\varphi} - 1}\left\{ {d^{({k - 1})}\left( {\overset{\_}{a}}^{({k - 1})} \right)}^{H} \right\}}} \cong {\quad\begin{bmatrix} {c_{x}B_{\varphi}^{(k)}{\cos\left( \kappa^{(k)} \right)}{\exp\left( {j\varphi}_{x}^{(k)} \right)}} & {{- c_{x}}B_{\varphi}^{(k)}{\sin\left( \kappa^{(k)} \right)}{\exp\left( {j\varphi}_{x}^{(k)} \right)}} \\ {c_{y}B_{\varphi}^{(k)}{\sin\left( \kappa^{(k)} \right)}{\exp\left( {j\varphi}_{y}^{(k)} \right)}} & {c_{y}B_{\varphi}^{(k)}{\cos\left( \kappa^{(k)} \right)}{\exp\left( {j\varphi}_{y}^{(k)} \right)}} \end{bmatrix}}}}} & (34) \end{matrix}$ where

$\begin{matrix} {{B_{\varphi}^{(k)} = {\frac{1}{N_{\varphi}}{\sum\limits_{1 = 0}^{N_{\varphi} - 1}{{\overset{\_}{a}}_{x}^{({k - 1})}}^{2}}}},} & (35) \end{matrix}$ assuming

$\begin{matrix} {{\frac{1}{N_{\varphi}}{\sum\limits_{1 = 0}^{N_{\varphi} - 1}{{\overset{\_}{a}}_{x}^{({k - 1})}}^{2}}} \cong {\frac{1}{N_{\varphi}}{\sum\limits_{1 = 0}^{N_{\varphi} - 1}{{\overset{\_}{a}}_{y}^{({k - 1})}}^{2}}}} & (36) \end{matrix}$

In general, the value of N_(φ) is smaller than N_(κ) owing to the nature of the phase noise, which changes faster than the polarization angle. However, this reduction of the averaging window may enhance noise effects on the estimates. Nevertheless, this effect is significantly reduced when the polarization rotation is accurately tracked (|κ^((k))|→0).

The loop filters 814 and 824 have impulse response ℑ_(φ) ^((k))=(f_(φ,x) ^((k)), f_(φ,y) ^((k))) and f_(θ) ^((k)) to provide dynamics to the phase estimator 810 and polarization angle estimator 820, respectively. The adders 816 and 826 add the delayed estimates provided by the delay elements 816 and 826 to the respective filter outputs to generate the phase and polarization estimates, respectively, as follows {circumflex over (φ)}_(x) ^((k+1))={circumflex over (φ)}_(x) ^((k))+ƒ_(φ,x) ^((k)){circle around (x)}φ_(x) ^((k)), {circumflex over (φ)}_(y) ^((k+1))={circumflex over (φ)}_(y) ^((k))+ƒ_(φ,y) ^((k)){circle around (x)}φ_(y) ^((k)),  (37) {circumflex over (θ)}^((k+1))={circumflex over (θ)}^((k))+ƒ_(θ) ^((k)){circle around (x)}κ^((k)),  (38) where {circle around (x)} denotes convolution sum.

The rotation matrix calculator 830 generates the phase and polarization matrix A^((k+1)) using the {circumflex over (Φ)}^((k+1)) and {circumflex over (θ)}^((k+1)) computed in equations (37) and (38) as follows:

$\begin{matrix} {A^{(k)} = {{\begin{bmatrix} {\exp\left( {{- j}{\hat{\phi}}_{x}^{(k)}} \right)} & 0 \\ 0 & {\exp\left( {{- j}{\hat{\phi}}_{y}^{(k)}} \right)} \end{bmatrix}\left\lbrack \begin{matrix} {\cos{\hat{\theta}}^{(k)}} & {\sin\;{\hat{\theta}}^{(k)}} \\ {{- \sin}\;{\hat{\theta}}^{(k)}} & {\cos\;{\hat{\theta}}^{(k)}} \end{matrix} \right\rbrack} = {\quad\left\lbrack \begin{matrix} {\cos{\hat{\theta}}^{(k)}{\exp\left( {{- j}{\hat{\phi}}_{x}^{(k)}} \right)}} & {\sin{\hat{\theta}}^{(k)}{\exp\left( {{- j}{\hat{\phi}}_{x}^{(k)}} \right)}} \\ {{- \sin}{\hat{\theta}}^{(k)}{\exp\left( {{- j}{\hat{\phi}}_{y}^{(k)}} \right)}} & {\cos{\hat{\theta}}^{(k)}{\exp\left( {{- j}{\hat{\phi}}_{y}^{(k)}} \right)}} \end{matrix} \right\rbrack}}} & (39) \end{matrix}$

The loop filters 814 and 824 may be implemented by a number of methods such as proportional, proportional plus integral, proportional plus integral plus derivative, or any other suitable filtering techniques.

FIG. 9A is a diagram illustrating the loop filter 814 using a proportional filtering in the phase estimator according to one embodiment of the invention. It includes a multiplier 905. The multiplier 910 multiplies the phase angle (φ_(x) ^((k)), φ_(y) ^((k))) with filter coefficients or filter gains, δ_(x) and δ_(y), respectively. The Z-transforms of f_(φ,x) ^((k)) and f_(φ,y) ^((k)) are: F _(φ,x)(z)=δ_(x) F _(φ,y)(z)=δ_(y)  (40)

FIG. 9B is a diagram illustrating the loop filter 814 using a proportional plus integral filtering in the phase estimator according to one embodiment of the invention. It includes a multiplier 910, an adder 912, a delay element 914, a multiplier 916, and an adder 918.

The Z-transform of f_(φ,x) ^((k)) and f_(φ,y) ^((k)) are:

$\begin{matrix} {{{F_{\phi,x}(z)} = {\delta_{x} + \frac{\chi_{x}}{1 - z^{- 1}}}},{{F_{\phi,y}(z)} = {\delta_{y} + \frac{\chi_{y}}{1 - z^{- 1}}}},} & (41) \end{matrix}$ where, δ_(x), γ_(y), χ_(x) and χ_(y) are filter coefficients.

FIG. 10A is a diagram illustrating the loop filter 824 using a proportional filtering in the polarization angle estimator according to one embodiment of the invention. It includes a multiplier 1005. The multiplier 1005 multiplies the polarization angle κ^((k)) with a filter coefficient, or gain, δ_(θ). The Z-transform of f_(θ) ^((k)) is: F _(θ)(z)=δ_(θ).  (42)

FIG. 10B is a diagram illustrating the loop filter 814 using a proportional plus integral filtering in the polarization angle estimator according to one embodiment of the invention. It includes a multiplier 1010, an adder 1012, a delay element 1014, a multiplier 1016, and an adder 1018. The Z-transform of f_(θ) ^((k)) is:

$\begin{matrix} {{{F_{\theta}(z)} = {\delta_{\theta} + \frac{\chi_{\theta}}{1 - z^{- 1}}}},} & (43) \end{matrix}$ where δ_(θ) and χ_(θ) are filter coefficients.

One embodiment of the present invention is simulated using a symbol rate of 10 GBauds and a data rate of 40 Gb/s. The simulation uses a typical single mode fiber as specified by the International Telecommunication Union (ITU) G.652 Recommendation used in the third telecommunication window (1550 nm) which leads to a dispersion parameter D=17 ps/km/nm. The PMD is set at 10 ps/√{square root over (km)}. The fiber is modeled using the coarse step method, with more than 100 sections of birefringent fiber. This adequately models first- and higher order PMD as well as CD.

The signal-to-noise ratio (SNR) is defined as 10 log 10 (E_(b)/N₀) dB where N₀ is the total noise variance given by the sum of ASE, shot, and thermal noise variance. E_(b) is the mean received energy per bit. The phase noise parameter is Δv T. Two polarization multiplexed QDPSK constellations at a signaling rate of 10 GBauds are used. The transmitter pulse shape is Gaussian with a full width at half maximum T_(FWHM)=60 ps.

The results when the phase noise parameter is set to zero are as follows. An 8-tap equalizer is sufficient to compensate up to 200 km of fiber with about 1 dB penalty. A 10-tap equalizer can reach 250 km, and a 15-tap equalizer can compensate more than 300 km. With a channel length of 300 km and a 15-tap equalizer, the system can handle up to 20 MHz of laser phase noise with a penalty of less than 3 dB for a constant bit error arte (BER) of 10⁻⁶. In general, the equalizer can compensate channel dispersion of up to 1000 km of single mode fiber, with less than 3 dB penalty in SNR. These numerical results are shown only to show the efficiency of the equalizer for certain system parameters. They are not definitive values or theoretical limits and are not intended to limit other results in other system parameters and configurations.

Thus, one embodiment of the present invention offers a number of advantages over prior art techniques: (1) long distances may be efficiency compensated with existing technology, (2) feasibility of using VLSI implementation for the receivers, (3) the technique is suitable for both analog and digital implementation.

The embodiments described in the invention use DQPSK modulation on each axis of polarization. However, the receiver can decode simpler modulation formats, such as the intensity modulation. The receiver could be used to detect signals generated by conventional intensity modulated transmitters. Of course the data rate would be reduced accordingly, but the advantage is that the customer does not need to upgrade both sides (transmit and receive) at the same time. The customer may upgrade only the receiver initially, and continue to operate at the same data rate as before the upgrade. Later the customer may upgrade the transmitter and quadruple the data rate. The receiver is also backward compatible with DQPSK without polarization modulation, DBPSK with or without polarization modulation, amplitude shift keying (ASK) with or without polarization modulation, etc.

One embodiment of the present invention can be implemented by digital signal processing, analog signal processing or a mixed-mode signal processing. Digital signal processing includes, but is not limited to, digital signal processors (DSPs), programmable devices such as complex programmable logic devices (CPLDs), field programmable gate arrays (FPGAs), etc., and custom integrated circuits in technologies like, for example, complementary metal oxide semiconductor (CMOS).

Several embodiments of the present invention are available. The embodiment presented above is the multidimensional linear equalizer. Other embodiments include, but are not limited to, soft-input/soft-output (SISO) multidimensional transversal filter equalizers (SISO-MTFE), turbo (iterative) multidimensional transversal filter equalizer (T-MTFE), multidimensional decision feedback equalizers (DFE), and multidimensional maximum likelihood sequence estimators (MLSE).

FIG. 11A is a diagram illustrating a SISO-MTFE 1100 according to one embodiment of the invention. The SISO-MTFE 1100 includes a linear equalizer 1110, a rotator 1112, a mapper 1120, and a channel estimator 1130.

Let b_(b,x) ^((k)) (b_(b,y) ^((k))) be a set of bits (e.g., the output of channel codes) that is mapped to a symbol b_(s,x) ^((k)) (b_(s,y) ^((k))) (e.g., b_(b,x) ^((k))ε{(00)(01)(10)(11)} and b_(s,x) ^((k))ε{(1+√{square root over (−1)})/√{square root over (2)}, (−1+√{square root over (−1)})/√{square root over (2)}, (−1−√{square root over (−1)})/√{square root over (2)}} for QAM). Let C^((k)) be the matrix of equalizer coefficients defined by:

$\begin{matrix} {{C^{(k)} = \begin{bmatrix} c_{11}^{(k)} & c_{12}^{(k)} \\ c_{21}^{(k)} & c_{22}^{(k)} \end{bmatrix}},} & (44) \end{matrix}$ where c_(ij) ^((k)) is an L_(c×1) vector coefficient defined by c _(ij) ^((k)) =[c _(ij) ^((k)(−N) ¹ ⁾ c _(ij) ^((k)(−N) ¹ ⁺¹⁾ . . . c _(ij) ^((k)(N) ² ⁾]^(T) ^(r) , i,j=1,2,  (45) with L_(c)=N₁+N₂+1 (T_(r) denotes transpose). Vector coefficients c_(ij) ^((k)) may be designed by using any of several methods such as MMSE.

For consistency with other notations, the following notations may be defined. H_(ij) ^((k)) the L_(c)×(L_(c)+L_(h)−1) (i, j)-th (baud rate) channel convolution matrix given by:

                                          (46) $H_{ij}^{(k)} = {\quad{{\begin{bmatrix} h_{ij}^{{(k)}{({L_{h} - 1})}} & h_{ij}^{{(k)}{({L_{h} - 2})}} & \ldots & h_{ij}^{{(k)}{(0)}} & 0 & 0 & \ldots & 0 \\ 0 & h_{ij}^{{(k)}{({L_{h} - 1})}} & \ldots & h_{ij}^{{(k)}{(1)}} & h_{ij}^{{(k)}{(0)}} & 0 & \ldots & 0 \\ \; & \; & \ddots & \; & \; & \; & \; & \; \\ 0 & 0 & \ldots & h_{ij}^{{(k)}{({L_{h} - 1})}} & h_{ij}^{{(k)}{({L_{h} - 2})}} & \ldots & h_{ij}^{{(k)}{(1)}} & h_{ij}^{{(k)}{(0)}} \end{bmatrix}\mspace{79mu} i},{j = 1},2,}}$ where [h_(ij) ^((k)(0)), h_(ij) ^((k)(1)), . . . , h_(ij) ^((k)(L) ^(h) ⁻¹⁾] is the impulse response of the (i, j)-th channel of length L_(h). B_(s,x) ^((k)) and B_(s,y) ^((k)) are (L_(c)+L_(h)−1)×1 dimensional transmitted symbol vectors given by: B _(s,i) ^((k)) =[b _(s,i) ^((k−L) ^(h) ^(−N) ² ⁺¹⁾ b _(s,i) ^((k−L) ^(h) ^(−N) ² ⁺²⁾ . . . b _(s,i) ^((k+N) ¹ ⁾]^(T) ^(r) i=x,y.  (47) N_(x) ^((k)) and N_(y) ^((k)) are L_(c)×1 dimensional noise vectors given by: N _(i) ^((k)) =[n _(i) ^((k−N) ² ⁾ n _(i) ^((k−N) ² ⁺1) . . . n _(i) ^((k+N) ₁ ⁾]^(T) ^(r) i=x,y.  (48) Φ^((k)) is the 2L_(c)×2L_(c) diagonal phase rotation matrix defined by: Φ^((k))=Diag└e ^(jφ) ^(x) ^((k−N) ² ⁾ e ^(jφ) ^(x) ^((k−N) ² ⁺¹⁾ . . . e ^(jφ) ^(x) ^((k+N) ¹ ⁾ e ^(jφ) ^(x) ^((k+N) ¹ ⁾ e ^(jφ) ^(y) ^((k−N) ² ⁺¹⁾ . . . e ^(jφ) ^(y) ^((k+N) ¹ ⁾ ┐.  (49) {circumflex over (R)}_(x) ^((k)) and {circumflex over (R)}_(y) ^((k)) are L_(c)×1 dimensional received sample vectors with no polarization rotation given by {circumflex over (R)} _(i) ^((k)) =[{circumflex over (r)} _(i) ^((k−N) ² ⁾ {circumflex over (r)} _(i) ^((k−N) ² ⁺¹ . . . {circumflex over (r)} _(i) ^((k+N) ¹ ⁾]^(T) ^(r) i=x,y.  (50)

The multidimensional received samples vector with no polarization rotation, {circumflex over (R)}^((k)), can be expressed as

$\begin{matrix} {{{\hat{R}}^{(k)} = {\begin{bmatrix} {\hat{R}}_{x}^{(k)} \\ {\hat{R}}_{y}^{(k)} \end{bmatrix} = {{\Phi^{(k)}H^{(k)}B_{s}^{(k)}} + N^{(k)}}}},} & (51) \end{matrix}$ where H^((k)), B_(s) ^((k)), and N^((k)) are the multidimensional channel convolution matrix, symbol vector, and noise vector defined respectively by

$\begin{matrix} {{H^{(k)} = \begin{bmatrix} H_{11}^{(k)} & H_{12}^{(k)} \\ H_{21}^{(k)} & H_{22}^{(k)} \end{bmatrix}},} & (52) \\ {{B_{s}^{(k)} = \begin{bmatrix} B_{s,x}^{(k)} \\ B_{s,y}^{(k)} \end{bmatrix}},} & (53) \\ {N^{(k)} = {\begin{bmatrix} N_{x}^{(k)} \\ N_{y}^{(k)} \end{bmatrix}.}} & (54) \end{matrix}$

R_(x) ^((k)) and R_(y) ^((k)) are L_(c)×1 dimensional received sample vectors including polarization rotation given by R _(i) ^((k)) =[r _(i) ^((k−N) ² ⁾ r _(i) ^((k−N) ² ⁺¹⁾ . . . r _(i) ^((k+N) ¹ ⁾]^(T) ^(r) i=x,y.  (55) Elements of R_(x) ^((k)) and R_(y) ^((k)) can be obtained from the elements of {circumflex over (R)}_(x) ^((k)) and {circumflex over (R)}_(y) ^((k)) as

$\begin{matrix} {\begin{bmatrix} r_{x}^{(k)} \\ r_{y}^{(k)} \end{bmatrix} = {{\begin{bmatrix} {\cos\left( \theta^{(k)} \right)} & {- {\sin\left( \theta^{(k)} \right)}} \\ {\sin\left( \theta^{(k)} \right)} & {\cos\left( \theta^{(k)} \right)} \end{bmatrix}\begin{bmatrix} {\hat{r}}_{x}^{(k)} \\ {\hat{r}}_{y}^{(k)} \end{bmatrix}}.}} & (56) \end{matrix}$

The linear equalizer 1110 equalizes the received sample vector

$R^{(k)} = \begin{bmatrix} R_{x}^{(k)} \\ R_{y}^{(k)} \end{bmatrix}$ using a matrix equalizer coefficients C^((k)) as follows:

$\begin{matrix} {{{\overset{\hat{\sim}}{b}}_{s}^{(k)} = {\begin{bmatrix} {\overset{\hat{\sim}}{b}}_{s,x}^{(k)} \\ {\overset{\hat{\sim}}{b}}_{s,y}^{(k)} \end{bmatrix} = {\left( C^{(k)} \right)^{H}R^{(k)}}}},} & (57) \end{matrix}$ where^(H) denotes transpose conjugate.

The output sample {tilde over ({circumflex over (b)}_(s) ^((k)) is rotated by the phase and polarization rotator 1112 to obtain the estimate of the transmitted symbol

${b_{s}^{(k)} = \begin{bmatrix} b_{s,x}^{(k)} \\ b_{s,y}^{(k)} \end{bmatrix}},$ which is denoted by

${\hat{b}}_{s}^{(k)} = {\begin{bmatrix} {\hat{b}}_{s,w}^{(k)} \\ {\hat{b}}_{s,y}^{(k)} \end{bmatrix}.}$

The mapper 1120 processes {circumflex over (b)}_(s) ^((k)) to provide the soft-output L_(E)(b_(b) ^((k))). For example, assuming that {circumflex over (b)}_(s) ^((k)) is Gaussian and BPSK modulation (b_(s,i) ^((k))=±1, i=x, y) the mapper yields:

$\begin{matrix} {{{L_{E}\left( b_{b}^{(k)} \right)} = \begin{bmatrix} {2\frac{\mu_{x,{+ 1}}^{(k)}}{\left( \sigma_{x}^{(k)} \right)}{Re}\left\{ {\hat{b}}_{s,x}^{(k)} \right\}} \\ {2\frac{\mu_{y,{+ 1}}^{(k)}}{\left( \sigma_{y}^{(k)} \right)}{Re}\left\{ {\hat{b}}_{s,y}^{(k)} \right\}} \end{bmatrix}},} & (58) \end{matrix}$ where μ_(x,+1) ^((k)) (μ_(y,+1) ^((k)) and (σ_(x) ^((k)))² ((σ_(y) ^((k)))²) are the mean and variance of the received signal component x (y) for b_(s,x) ^((k))=+1 (b_(s,y) ^((k))=+1).

In one embodiment, these parameters are estimated from the filter coefficients matrix C^((k)) and the information provided by the channel estimator 1130. The channel estimator 1130 provides estimates of the channel response H^((k)), the phase and polarization rotation matrix A^((k)), and noise powers σ_(n) _(x) ² and σ_(n) _(y) ².

FIG. 11B is a diagram illustrating a T-MTFE 1135 according to one embodiment of the invention. The T-MTFE 1135 is one embodiment of the T-MTFE working at baud rate and is derived from the MMSE criterion. The T-MTFE 1135 includes a rotation compensator 1140, a combiner 1150, a linear equalizer 1160, a mapper 1170, a channel estimator 1180, a prior estimator 1184, and a prior signal estimator 1182.

In the present invention, phase and polarization rotation may be compensated after or before equalization as discussed earlier. Although in general, rotation before equalization may achieve worse performance due to the bandwidth reduction of the tracking loop, it can be used to compensate phase and polarization rotation with reasonable accuracy. The T-MTFE provides (iteratively) soft-outputs L_(E)(b_(b) ^((k)))=[L_(E)(b_(b,x) ^((k))) L_(E)(b_(b,y) ^((k)))]^(T) ^(r) based on the received samples and the a priori information L(b_(b) ^((k)))=[L(b_(b,x) ^((k))) L(b_(b,y) ^((k)))]^(T) ^(r) provided by channel decoders. The use of a priori information L(b_(b) ^((k))) improves the reliability of the equalizer soft-outputs. The reliabilities L(b_(b) ^((k))) and L_(E)(b_(b) ^((k))) improve with the iteration number. This way, performance also improves with the iteration number.

The vector signal at the output of the phase and polarization rotation compensator 1140 can be expressed as

$\begin{matrix} {{{\overset{\sim}{R}}^{(k)} = {\begin{bmatrix} {\overset{\sim}{R}}_{x}^{(k)} \\ {\overset{\sim}{R}}_{y}^{(k)} \end{bmatrix} = {{H^{(k)}B_{s}^{(k)}} + {\overset{\sim}{N}}^{(k)}}}},} & (59) \end{matrix}$ where

${\overset{\sim}{N}}^{(k)} = \begin{bmatrix} {\overset{\sim}{N}}_{x}^{(k)} \\ {\overset{\sim}{N}}_{y}^{(k)} \end{bmatrix}$ with Ñ_(i) ^((k))=[ñ_(i) ^((k−N) ² ^() ñ) _(i) ^((k−N) ² ⁺¹⁾ . . . ñ_(i) ^((k+N) ¹ ⁾]^(T) ^(r) i=x, y, is the noise component vector at the output of the rotation compensator 1140.

In one embodiment, the outputs of a baud rate equalizer 1160 for a given iteration are calculated as {circumflex over (b)} _(s) ^((k))=(C ^((k)))^(H) [{tilde over (R)} ^((k)) −I ^((k))],  (60) where

$C^{(k)} = \begin{bmatrix} c_{11}^{(k)} & c_{12}^{(k)} \\ c_{21}^{(k)} & c_{22}^{(k)} \end{bmatrix}$ is the filter coefficient matrix and

${\hat{b}}_{s}^{(k)} = {\begin{bmatrix} {\hat{b}}_{s,x}^{(k)} \\ {\hat{b}}_{s,y}^{(k)} \end{bmatrix}.}$

Vector I^((k)) is updated in each iteration by the prior signal estimator 1182: I ^((k)) =H ^((k)) E{B _(s) ^((k)) }−S ^((k)) E{b _(s) ^((k))},  (61) where

$\begin{matrix} {{S^{(k)} = \begin{bmatrix} s_{11}^{(k)} & s_{12}^{(k)} \\ s_{21}^{(k)} & s_{22}^{(k)} \end{bmatrix}},} & (62) \\ {{s_{ij}^{(k)} = {H_{ij}^{(k)}\begin{bmatrix} 0_{1 \times {({N_{2} + L_{h} - 1})}} & 1 & 0_{1 \times N_{1}} \end{bmatrix}}^{T_{r}}}{i,{j = 1},2.}} & (63) \end{matrix}$

In one embodiment, the estimates Ĥ_(ij) ^((k)) and ŝ_(i,j) ^((k)) (i, j=1, 2) provided by the channel estimator 1180 are used instead of H_(ij) ^((k)) and s_(ij) ^((k)), respectively.

${E\left\{ B_{s}^{(k)} \right\}} = {{\begin{bmatrix} {E\left\{ B_{s,x}^{(k)} \right\}} \\ {E\left\{ B_{s,y}^{(k)} \right\}} \end{bmatrix}\mspace{14mu}{and}\mspace{14mu} E\left\{ b_{s}^{(k)} \right\}} = \begin{bmatrix} {E\left\{ b_{s,x}^{(k)} \right\}} \\ {E\left\{ b_{s,y}^{(k)} \right\}} \end{bmatrix}}$ are the mean values of the symbol vectors B_(s) ^((k)) and b_(s) ^((k)), respectively. E{b_(s,i) ^((k))} is the mean value of the symbol b_(s,i) ^((k)), while vectors E{B_(s,i) ^((k))} i=x, y are defined by E{B_(s,i) ^((k))}=[E{b_(s,i) ^((k−L) ^(h) ^(−N) ² ^(+1)}E{b) _(s,i) ^((k−L) ^(h) ^(−N) ² ⁺²⁾} . . . E{b_(s,i) ^((k+N) ¹ ⁾}]^(T) ^(r) .

E{b_(s) ^((k))} is updated in each iteration by the prior estimator 1184. In one embodiment, it is estimated using the a priori information on the occurrence probability of b_(b) ^((k)) provided by the channel decoder, L(b_(b) ^((k))). For example, for BPSK modulation (b_(s,i) ^((k))=±1, i=x, y), it may be obtained

$\begin{matrix} {{E\left\{ b_{s}^{(k)} \right\}} = {\begin{bmatrix} {\tanh\left( {{L\left( b_{b,x}^{(k)} \right)}/2} \right)} \\ {\tanh\left( {{L\left( b_{b,y}^{(k)} \right)}/2} \right)} \end{bmatrix}.}} & (64) \end{matrix}$

Vector coefficients c_(ij) ^((k)) are in general time varying and depend on both the channel and a priori information provided by the channel decoder (i.e., in general they vary in each iteration). In turbo equalization, filter coefficients are designed to obtain equalizer outputs {circumflex over (b)}_(s,x) ^((k)) and {circumflex over (b)}_(s,y) ^((k)) independent from L(b_(b,x) ^((k))) and L(b_(b,y) ^((k))).

The mapper 1170 processes

${\hat{b}}_{s}^{(k)} = \begin{bmatrix} {\hat{b}}_{s,x}^{(k)} \\ {\hat{b}}_{s,y}^{(k)} \end{bmatrix}$ to provide the soft-output L_(E)(b_(b) ^((k))). For example, assuming that {circumflex over (b)}_(s) ^((k)) is Gaussian, for BPSK modulation (b_(s,i) ^((k))=±1, i=x, y) the mapper 1170 yields:

$\begin{matrix} {{{L_{E}\left( b_{b}^{(k)} \right)} = \begin{bmatrix} {2\frac{\mu_{x,{+ 1}}^{(k)}}{\left( \sigma_{x}^{(k)} \right)^{2}}{Re}\left\{ {\hat{b}}_{s,x}^{(k)} \right\}} \\ {2\frac{\mu_{y,{+ 1}}^{(k)}}{\left( \sigma_{y}^{(k)} \right)^{2}}{Re}\left\{ {\hat{b}}_{s,y}^{(k)} \right\}} \end{bmatrix}},} & (65) \end{matrix}$ where μ_(x,+1) ^((k)) (μ_(y,+1) ^((k))) and (σ_(x) ^((k)))² ((σ_(y) ^((k)))²) are the mean and variance of the received signal component x (y) for b_(s,x) ^((k))=+1 (b_(s,y) ^((k))=+1), and Re{.} means real part.

In one embodiment, these parameters are estimated from the filter coefficient matrix C^((k)), the information provided by the channel estimator 1180 (i.e., Ĥ^((k)) and noise powers σ_(ñ) _(x) ² and σ_(ñ) _(y) ²), and the information provided the prior estimator 1184: E{b_(s) ^((k))} and

${{Cov}\left\{ b_{s}^{(k)} \right\}} = \begin{bmatrix} {{Cov}\left\{ {b_{s,x}^{(k)}b_{s,x}^{(k)}} \right\}} \\ {{Cov}\left\{ {b_{s,y}^{(k)}b_{s,y}^{(k)}} \right\}} \end{bmatrix}$ with Cov{b_(s,i) ^((k))b_(s,i) ^((k))}=1−|E{b_(s,i) ^((k))}|² i=x, y for BPSK modulation.

FIG. 12 is a diagram illustrating a DFE 1200 according to one embodiment of the invention. The DFE 1200 includes a feed forward equalizer 1210, an inverse rotator 615, a rotator 620, an adder 1220, a feedback equalizer 1215, a slicer 630, an error calculator 640, a delay conjugator 650, a multiplier 670, and a rotation matrix estimator 680.

The inverse rotator 615, the rotator 620, the slicer 630, the error calculator 640, the delay conjugator 650, the multiplier 670, and the rotation matrix estimator 680 are similar to the respective elements shown in FIG. 6.

The output of the feed forward equalizer 1210 is rotated by the rotator 620 and is added to the multidimensional feedback equalizer 1215 by the adder 1220 to provide the equalized samples d′^((k)):

$\begin{matrix} {{d_{x}^{\prime{(k)}} = {d_{x}^{(k)} + {\sum\limits_{n = 0}^{L_{cfb} - 1}{c_{{fb}\; 11}^{(n)}a_{x}^{- {({k - n})}}}} + {\sum\limits_{n = 0}^{L_{cfb} - 1}{c_{{fb}\; 21}^{(n)}a_{y}^{- {({k - n})}}}}}}{{d_{y}^{\prime{(k)}} = {d_{y}^{(k)} + {\sum\limits_{n = 0}^{L_{cfb} - 1}{c_{{fb}\; 12}^{(n)}a_{x}^{- {({k - n})}}}} + {\sum\limits_{n = 0}^{L_{cfb} - 1}{c_{{fb}\; 22}^{(n)}a_{y}^{- {({k - n})}}}}}},}} & (66) \end{matrix}$ where L_(cfb) is the number of coefficients of the feedback equalizer. The equalized signal d′^((k)) is thresholded by the thresholder 630 to obtain hard decisions for further decoding.

The adaptation process may be implemented by, but is not limited to, the minimum mean squared error criterion. In this case the coefficients of the feed forward equalizer 1210 and the coefficients of the feedback equalizer 1215 can be calculated, respectively, by: C _(ff) ^((k+1,m)) =C _(ff) ^((k,m))+ρ_(ff) [R ^((k,m))]^(H) [{tilde over (e)} ^((k))]^(Tr), C _(fb) ^((k+1)) =C _(fb) ^((k))+ρ_(fb)[α^((k))]^(H) [e ^((k))]^(Tr),  (67) where ρ_(ff) and ρ_(fb) are the step parameters for each update equation, α^((k))=[α_(x) ^((k)) α_(y) ^((k))], α_(x) ^((k)) and α_(y) ^((k)) are the L_(cfb)-dimensional row vectors with the hard decisions at the output of the thresholder 630 for the x and y polarization, respectively. The feed forward equalizer 1210 may work with fractionally spaced samples, the feedback equalizer 1215 may only work with samples at baud-rate.

FIG. 13 is a diagram illustrating a maximum likelihood sequence estimation receiver (MLSE) receiver 1300 according to one embodiment of the invention. The MLSE receiver 1300 includes an MLSE equalizer 1310, a rotation matrix estimator 1320, and a channel estimator 1130.

The received multidimensional vector at the output of the RFE 150 is decoded by a multidimensional MLSE. The output of the multidimensional MLSE equalizer 1310 may be either hard or soft for further processing. The MLSE receiver can also compensate for nonlinear impairments appearing during fiber propagation. The MLSE receiver can also be used in conjunction with the previously developed multidimensional linear equalizer 600 as well as with a multidimensional decision feedback equalizer 1200.

Let N be the total number of symbols transmitted. The maximum likelihood sequence detector chooses, among all the possible sequences, the one that minimizes the metric

$\begin{matrix} {{m_{r} = {\sum\limits_{k = 0}^{N - 1}{- {\log\left( {p\left( {r^{(k)}❘b^{(k)}} \right)} \right)}}}},} & (68) \end{matrix}$ where p(r^((k))|b^((k))) is the probability density function of the received signal conditioned to the transmitted sequence. The minimization can be efficiently implemented using, but not limited to, the Viterbi algorithm. When all the sources of noise are considered Gaussian, the branch metric computation is the Euclidean distance of the two four-dimensional vectors corresponding to the received signal and the possible received symbol. When there is no a priori information of the received signal statistics, the branch metric computation can be done by, but not limited to, estimating channel statistics.

The rotation matrix estimator 1320 may be the same as the phase and polarization rotation matrix estimator 680 shown in FIG. 6. Another embodiment of the present invention can use signal processing of the received signal to estimate the phase and polarization rotation matrix.

In another embodiment of the present invention, the Maximum Likelihood Sequence Estimator (MLSE) receiver 1300 is used in conjunction with the multidimensional linear equalizer 600. Such an embodiment can compensate for nonlinear channel distortions due to fiber nonlinearities. In this embodiment the multidimensional MLSE detector is fed with the output samples of the phase and polarization rotator 620.

In another embodiment of the present invention the MLSE receiver 1300 is used in conjunction with a multidimensional decision feedback equalizer 1200 to enhance performance. Such an embodiment can compensate for nonlinear channel distortions due to fiber nonlinearities. In this embodiment, the multidimensional MLSE detector is fed with the output samples of the phase and polarization rotator 620 of the DFE 1200 shown in FIG. 12.

Several other embodiments of the invention are envisioned. In one embodiment of the multidimensional linear equalizer, the adaptive transversal filters are implemented using parallel architectures in order to increase the processing speed. In one embodiment of the multidimensional decision feedback equalizer, the adaptive transversal filters are implemented using parallel architectures in order to increase the processing speed. In one embodiment of the multidimensional MLSE receiver, the decoding algorithm is implemented using parallel architectures of MLSE detectors. Such as, but not limited to, the sliding block Viterbi algorithm.

The present invention was presented above in the context of optical channels but it can be applied to any other multidimensional communication channels where a carrier is modulated to transmit symbols to a receiver through a channel with impairments for example, but not limited to, satellite downlinks where energy transfer from one orthogonal polarization to another arises due to said channel impairments.

While the invention has been described in terms of several embodiments, those of ordinary skill in the art will recognize that the invention is not limited to the embodiments described, but can be practiced with modification and alteration within the spirit and scope of the appended claims. The description is thus to be regarded as illustrative instead of limiting. 

What is claimed is:
 1. An apparatus comprising: a coefficient generator to generate filter coefficients using a rotated error vector; and a filter stage coupled to the coefficient generator to generate equalized samples from the input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols, wherein the receiver front end comprises at least a multidimensional rotator to rotate its input signal, wherein the coefficient generator comprises: a coefficient adjuster to generate a coefficient adjustment vector being a product of the rotated error vector, an input sample vector representing the input samples, and a step size parameter, and an adder coupled to the coefficient adjuster to add a previously calculated coefficient vector to the coefficient adjustment vector to generate a coefficient vector representing the filter coefficients.
 2. The apparatus of claim 1, wherein the multidimensional rotator rotates at least one of phase and polarization of its input signal.
 3. The apparatus of claim 2, wherein the multidimensional rotator is adaptively trained according to an optimality criterion.
 4. The apparatus of claim 3, wherein the optimality criterion is the minimization of the receiver mean squared error.
 5. The apparatus of claim 3, wherein the optimality criterion is the minimization of the receiver bit error rate.
 6. An apparatus comprising: a coefficient generator to generate filter coefficients using a rotated error vector; and a filter stage coupled to the coefficient generator to generate equalized samples from the input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols, wherein the receiver front end comprises at least a matched filter, wherein the coefficient generator comprises: a coefficient adjuster to generate a coefficient adjustment vector being a product of the rotated error vector, an input sample vector representing the input samples, and a step size parameter, and an adder coupled to the coefficient adjuster to add a previously calculated coefficient vector to the coefficient adjustment vector to generate a coefficient vector representing the filter coefficients.
 7. The apparatus of claim 6, wherein the matched filter is matched to the impairments of the optical channel.
 8. The apparatus of claim 6, wherein the matched filter is matched to at least the chromatic dispersion of the optical channel.
 9. The apparatus of claim 6, wherein the matched filter is matched to at least the polarization mode dispersion of the optical channel.
 10. The apparatus of claim 6, wherein the matched filter is matched to at least the skews of the optical channel.
 11. An apparatus comprising: a coefficient generator to generate filter coefficients using a rotated error vector; and a filter stage coupled to the coefficient generator to generate equalized samples from the input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols, wherein the optical transmission channel operates at a data rate of at least 10 Gigabauds, wherein the coefficient generator comprises: a coefficient adjuster to generate a coefficient adjustment vector being a product of the rotated error vector, an input sample vector representing the input samples, and a step size parameter, and an adder coupled to the coefficient adjuster to add a previously calculated coefficient vector to the coefficient adjustment vector to generate a coefficient vector representing the filter coefficients.
 12. An apparatus comprising: a coefficient generator to generate filter coefficients using a rotated error vector; a filter stage coupled to the coefficient generator to generate equalized samples from input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols; a rotator coupled to the filter stage to rotate the equalized samples to generate the rotated equalized samples; a slicer coupled to the rotator to threshold a slicer input vector to generate a slicer output vector; an inverse rotator coupled to the coefficient generator to generate the rotated error vector using an error vector and a rotation matrix; an error calculator coupled to the slicer to calculate the error vector, the error vector being a difference vector between a thresholded rotated vector and a rotated vector; and a rotation matrix estimator coupled to the slicer to generate the rotation matrix using the equalized samples.
 13. The apparatus of claim 12, wherein the receiver front end comprises at least a multidimensional rotator to rotate its input signal.
 14. The apparatus of claim 13, wherein the multidimensional rotator rotates at least one of phase and polarization of its input signal.
 15. The apparatus of claim 14, wherein the multidimensional rotator is adaptively trained according to an optimality criterion.
 16. The apparatus of claim 15, wherein the optimality criterion is the minimization of the receiver mean squared error.
 17. The apparatus of claim 15, wherein the optimality criterion is the minimization of the receiver bit error rate.
 18. The apparatus of claim 12, wherein the receiver front end comprises at least a matched filter.
 19. The apparatus of claim 18, wherein the matched filter is matched to the impairments of the optical channel.
 20. The apparatus of claim 18, wherein the matched filter is matched to at least the chromatic dispersion of the optical channel.
 21. The apparatus of claim 18, wherein the matched filter is matched to at least the polarization mode dispersion of the optical channel.
 22. The apparatus of claim 18, wherein the matched filter is matched to at least the skews of the optical channel.
 23. A method comprising: generating filter coefficients using a rotated error vector by (i) generating a coefficient adjustment vector being a product of the rotated error vector, an input sample vector representing the input samples, and a step size parameter, and (ii) adding a previously calculated coefficient vector to the coefficient adjustment vector to generate a coefficient vector representing the filter coefficients; and generating equalized samples from the input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols, wherein the optical transmission channel operates at a data rate of at least 10 Gigabauds.
 24. A method comprising: generating filter coefficients using a rotated error vector; generating equalized samples from input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols; rotating the equalized samples to generate the rotated equalized samples; thresholding a slicer input vector to generate a slicer output vector; generating the rotated error vector using an error vector and a rotation matrix; calculating the error vector, the error vector being a difference vector between a thresholded rotated vector and a rotated vector; and generating the rotation matrix using the equalized samples.
 25. A system comprising: a receiver front end circuit to generate received samples transmitted in an optical transmission channel carrying transmitted symbols; and a signal processor coupled to the receiver front end circuit to generate received symbols corresponding to the transmitted symbols, the signal processor comprising: a coefficient generator to generate filter coefficients using an error vector and input samples, and a filter stage coupled to the coefficient generator to generate equalized samples from the input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols, wherein the optical transmission channel operates at a symbol rate of at least 10 Gigabauds.
 26. The system of claim 25, wherein the receiver front end comprises at least a multidimensional rotator to rotate its input signal.
 27. The system of claim 26, wherein the multidimensional rotator rotates at least one of phase and polarization of its input signal.
 28. The system of claim 27, wherein the multidimensional rotator is adaptively trained according to an optimality criterion.
 29. The system of claim 28, wherein the optimality criterion is the minimization of the receiver mean squared error.
 30. The system of claim 28, wherein the optimality criterion is the minimization of the receiver bit error rate.
 31. The system of claim 25, wherein the receiver front end comprises at least a matched filter.
 32. The system of claim 31, wherein the matched filter is matched to the impairments of the optical channel.
 33. The system of claim 31, wherein the matched filter is matched to at least the chromatic dispersion of the optical channel.
 34. The system of claim 31, wherein the matched filter is matched to at least the polarization mode dispersion of the optical channel.
 35. The system of claim 31, wherein the matched filter is matched to at least the skews of the optical channel.
 36. A system comprising: a receiver front end circuit to generate received samples transmitted in an optical transmission channel carrying transmitted symbols, wherein the optical transmission channel operates at a data rate of at least 10 Gigabauds; and a signal processor coupled to the receiver front end circuit to generate received symbols corresponding to the transmitted symbols, the signal processor comprising: a coefficient generator to generate filter coefficients using a rotated error vector, wherein the coefficient generator comprises: (i) a coefficient adjuster to generate a coefficient adjustment vector being a product of the rotated error vector, an input sample vector representing the input samples, and a step size parameter, and (ii) an adder coupled to the coefficient adjuster to add a previously calculated coefficient vector to the coefficient adjustment vector to generate a coefficient vector representing the filter coefficients, and a filter stage coupled to the coefficient generator to generate equalized samples from the input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols.
 37. The system of claim 36, wherein the receiver front end comprises at least a multidimensional rotator to rotate its input signal.
 38. The system of claim 37, wherein the multidimensional rotator rotates at least one of phase and polarization of its input signal.
 39. The system of claim 38, wherein the multidimensional rotator is adaptively trained according to an optimality criterion.
 40. The system of claim 39, wherein the optimality criterion is the minimization of the receiver mean squared error.
 41. The system of claim 39, wherein the optimality criterion is the minimization of the receiver bit error rate.
 42. The system of claim 36, wherein the receiver front end comprises at least a matched filter.
 43. The system of claim 42, wherein the matched filter is matched to the impairments of the optical channel.
 44. The system of claim 42, wherein the matched filter is matched to at least the chromatic dispersion of the optical channel.
 45. The system of claim 42, wherein the matched filter is matched to at least the polarization mode dispersion of the optical channel.
 46. The system of claim 42, wherein the matched filter is matched to at least the skews of the optical channel.
 47. A system comprising: a receiver front end circuit to generate received samples transmitted in an optical transmission channel carrying transmitted symbols; and a signal processor coupled to the receiver front end circuit to generate received symbols corresponding to the transmitted symbols, the signal processor comprising: a coefficient generator to generate filter coefficients using a rotated error vector, a filter stage coupled to the coefficient generator to generate equalized samples from input samples using the filter coefficients, the input samples being provided by a receiver front end in an optical transmission channel carrying transmitted symbols, a rotator coupled to the filter stage to rotate the equalized samples to generate the rotated equalized samples, a slicer coupled to the rotator to threshold a slicer input vector to generate a slicer output vector, an inverse rotator coupled to the coefficient generator to generate the rotated error vector using an error vector and a rotation matrix, an error calculator coupled to the slicer to calculate the error vector, the error vector being a difference vector between a thresholded rotated vector and a rotated vector, and a rotation matrix estimator coupled to the slicer to generate the rotation matrix using the equalized samples.
 48. The system of claim 47, wherein the receiver front end comprises at least a multidimensional rotator to rotate its input signal.
 49. The system of claim 48, wherein the multidimensional rotator rotates at least one of phase and polarization of its input signal.
 50. The system of claim 49, wherein the multidimensional rotator is adaptively trained according to an optimality criterion.
 51. The system of claim 50, wherein the optimality criterion is the minimization of the receiver mean squared error.
 52. The system of claim 50, wherein the optimality criterion is the minimization of the receiver bit error rate.
 53. The system of claim 47, wherein the receiver front end comprises at least a matched filter.
 54. The system of claim 53, wherein the matched filter is matched to the impairments of the optical channel.
 55. The system of claim 53, wherein the matched filter is matched to at least the chromatic dispersion of the optical channel.
 56. The system of claim 53, wherein the matched filter is matched to at least the polarization mode dispersion of the optical channel.
 57. The system of claim 53, wherein the matched filter is matched to at least the skews of the optical channel. 